The box mover problem
نویسنده
چکیده
We show that the optimization problem is NP-hard for a wide class of motion planning puzzles, including classical SOKOBAN. We investigate a new problem, the Box Mover Problem (BMP), in which the agent is allowed to lift and carry boxes on a rectilinear grid in order to rearrange them. Some classical motion planning puzzles are special cases of BMP. We also identify a natural class of BMP instances, for which optimization is in NP, making the optimization problems from the class NP-complete.
منابع مشابه
Sketching Earth-Mover Distance on Graph Metrics
We develop linear sketches for estimating the Earth-Mover distance between two point sets, i.e., the cost of the minimum weight matching between the points according to some metric. While Euclidean distance and Edit distance are natural measures for vectors and strings respectively, Earth-Mover distance is a well-studied measure that is natural in the context of visual or metric data. Our work ...
متن کاملOn the Localization of the Prime Mover Torque Perturbations in Synchronous Electric Machines via Multirate Digital Controllers
In this paper, a new -control technique is proposed, in order to attenuate changes in the prime mover torque which degrade the performance of synchronous electric machines. The proposed technique relies on multirate-output controllers. Its main feature consists in reducing the original problem, to an associate discrete -control problem for which a fictitious static state feedback controller is ...
متن کاملSelection of the optimum prime mover and the working fluid in a regenerative organic rankine cycle
A regenerative organic Rankine cycle (RORC) is modeled and optimized for the use of waste heat recovery from a prime mover (PM). Three PMs including, a diesel engine, a gas engine, and a microturbine are selected in this study. Four refrigerants including isobutane, R123, R134a, and R245fa are selected. The nominal capacity of the PM, PM operating partial load, turbine inlet pressure, condenser...
متن کاملCommunication and Cooperation
The authors focus on trust games in the context of two aspects of communication: content (relevant vs. irrelevant communication) and media-richness (face to face, FtF, vs. computer-mediated communication, CMC). In the trust game they studied, there are two players: first-mover and second-mover. The first-mover received 6$ and she could decide to send any discrete amount of dollars to the second...
متن کاملDevelopment of a mover having one nanometer precision and 4mm moving range
In order to have an experience on movers having a nanometer precision, a mover has been fabricated and its performance is tested. In the ILC, range of about 1mm is required to cure the long term drift of the tunnel floor and precision of some nanometers is required during the beam operation in IR (Interaction Region). To achieve these range and precision, the mover has two stages, coarse mover ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004